Cooperation between Edges and Junctions for Edge
نویسنده
چکیده
Edge detection is a fundamental stage in order to facilitate the analysis or the interpretation of an image. However classical edge detectors usually yield gaps in the contour image. To restore incomplete contours, criteria based on perceptual grouping have been proposed. Almost all existing closing algorithms based only on these criteria fail at discontinuity points junction. In this perspective we propose an original algorithm which combines perceptual grouping criteria and junction points. Furthermore, grouping is done by pre-processing iteratively in a bottom-up, local-to-global fashion.
منابع مشابه
Structure of the orifice of the renal artery in the abdominal aorta in adult male dog
One of the locations of renal artery atherosclerosis is at the orifice of the renal artery, therefore thestructure of this orifice was assessed in 6 normal, adult male dogs by light microscopy (LM) andtransmission electron microscopy (TEM). For the LM study, processed tissues were embedded in paraffinand sectioned serially into 6-μm thickness. Sections were stained with orcein. For the TEM stud...
متن کاملNoisy images edge detection: Ant colony optimization algorithm
The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملArticulation in the context of edge classification.
Many researchers believe the human visual system classifies luminance edges into those produced by reflectance edges or those produced by illumination edges, yet this classification process is not completely understood. One suggestion is that heuristics are used for edge classification. For example. specific contrast relationships at the luminance edge ('codirectional contrast invariance' and '...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کامل